Non-regular unary language and parallel communicating Watson–Crick automata systems
نویسندگان
چکیده
منابع مشابه
Non-regular unary language and parallel communicating Watson-Crick automata systems
In 2006, Czeizler et.al. introduced parallel communicating Watson-Crick automata system. They showed that parallel communicating Watson-Crick automata system can accept the non-regular unary language L={ , > 1} using non-injective complementarity relation and three components. In this paper, we improve on Czeizler et.al. work by showing that parallel communicating Watson-Crick automata system c...
متن کاملParallel Communicating Pushdown Automata Systems
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request, using a communication strategy borrowed from grammar system theory. We investigate the computational power of these mechanisms. We prove that non-centralized para...
متن کاملParallel Communicating Watson-Crick Automata Systems
Watson-Crick automata are finite state automata working on doublestranded tapes, introduced to investigate the potential of DNA molecules for computing. In this paper we introduce the concept of parallel communicating Watson-Crick automata systems. It consists of several Watson-Crick finite automata parsing independently the same input and exchanging information on request, by communicating sta...
متن کاملDeterministic parallel communicating Watson-Crick automata systems
In this paper, we have introduced the deterministic variant of parallel communicating Watson-Crick automata systems. We show that similar to the non-deterministic version, the deterministic version can also recognise some non-regular uniletter languages. We further establish that strongly deterministic Watson-Crick automata systems and deterministic Watson-Crick automata system are incomparable...
متن کاملOn Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGS we study two complexity measures called generation complexity and distribution complexity, and we prove that a PCGS Π , for which the generation complexity and the distribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.09.008